Snake illusion, edge classification, and edge curvature
نویسندگان
چکیده
منابع مشابه
The roles of image decomposition and edge curvature in the ‘snake’ lightness illusion
The snake illusion is an effect in which the lightness of target patches is strongly affected by the luminance of remote patches. One explanation is that such images are decomposed into a pattern of illumination and a pattern of reflectance, involving a classification of luminance edges into illumination and reflectance edges. Based on this decomposition, perceived reflectance is determined by ...
متن کاملSufficient conditions for maximally edge-connected and super-edge-connected
Let $G$ be a connected graph with minimum degree $delta$ and edge-connectivity $lambda$. A graph ismaximally edge-connected if $lambda=delta$, and it is super-edge-connected if every minimum edge-cut istrivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree.In this paper, we show that a connected graph or a connected triangle-free graph is maximall...
متن کاملCombining Curvature Motion and Edge-Preserving Denoising
In this paper we investigate a family of partial di erential equations (PDEs) for image processing which can be regarded as isotropic nonlinear di usion with an additional factor on the right-hand side. The one-dimensional analogues to this lter class have been motivated as scaling limits of one-dimensional adaptive averaging schemes. In 2-D, mean curvature motion is one of the most prominent e...
متن کاملIntensity-Based Edge Classification
A new intensity-based approach to the classification of edges was developed and implemented. Using basic continuity and independence properties of scenes and images, signatures were deduced for each of several edge types expressed in terms of correlational properties of the image intensities in the neighborhood of the edge. This procedure’s ability to discriminate occluding contours from cast s...
متن کاملBinomial edge ideals and rational normal scrolls
Let $X=left( begin{array}{llll} x_1 & ldots & x_{n-1}& x_n\ x_2& ldots & x_n & x_{n+1} end{array}right)$ be the Hankel matrix of size $2times n$ and let $G$ be a closed graph on the vertex set $[n].$ We study the binomial ideal $I_Gsubset K[x_1,ldots,x_{n+1}]$ which is generated by all the $2$-minors of $X$ which correspond to the edges of $G.$ We show that $I_G$ is Cohen-Macaula...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Vision
سال: 2010
ISSN: 1534-7362
DOI: 10.1167/10.7.420